Matrix representation – Hajos stable graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

NILPOTENT GRAPHS OF MATRIX ALGEBRAS

Let $R$ be a ring with unity. The undirected nilpotent graph of $R$, denoted by $Gamma_N(R)$, is a graph with vertex set ~$Z_N(R)^* = {0neq x in R | xy in N(R) for some y in R^*}$, and two distinct vertices $x$ and $y$ are adjacent if and only if $xy in N(R)$, or equivalently, $yx in N(R)$, where $N(R)$ denoted the nilpotent elements of $R$. Recently, it has been proved that if $R$ is a left A...

متن کامل

A stable iteration to the matrix inversion

The matrix inversion plays a signifcant role in engineering and sciences. Any nonsingular square matrix has a unique inverse which can readily be evaluated via numerical techniques such as direct methods, decomposition scheme, iterative methods, etc. In this research article, first of all an algorithm which has fourth order rate of convergency with conditional stability will be proposed. ...

متن کامل

Matrix Representation of Iterative Approximate Byzantine Consensus in Directed Graphs

This paper presents a proof of correctness of an iterative approximate Byzantine consensus (IABC) algorithm for directed graphs. The iterative algorithm allows faultfree nodes to reach approximate conensus despite the presence of up to f Byzantine faults. Necessary conditions on the underlying network graph for the existence of a correct IABC algorithm were shown in our recent work [15, 16]. [1...

متن کامل

Hajos-Parrish reaction mechanism

Organic chemist, born 1926 (Budapest, Hungary). Ph.D. (Technical Sciences) Technical University, Budapest, 1950. MS, Technical University, Budapest,1947. Assistant Professor Technical University, Budapest, Hungary 1948-1957. Research scientist Princeton University, Princeton, NJ 1957-1960; Hoffmann-La Roche, Inc. Nutley, NJ 1960-1970; University of Vermont, Burlington, VT 1972-1973; University ...

متن کامل

nilpotent graphs of matrix algebras

let $r$ be a ring with unity. the undirected nilpotent graph of $r$, denoted by $gamma_n(r)$, is a graph with vertex set ~$z_n(r)^* = {0neq x in r | xy in n(r) for some y in r^*}$, and two distinct vertices $x$ and $y$ are adjacent if and only if $xy in n(r)$, or equivalently, $yx in n(r)$, where $n(r)$ denoted the nilpotent elements of $r$. recently, it has been proved that if $r$ is a left ar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IOP Conference Series: Materials Science and Engineering

سال: 2017

ISSN: 1757-8981,1757-899X

DOI: 10.1088/1757-899x/263/4/042136